Random assignments of bundles
نویسندگان
چکیده
منابع مشابه
On Popular Random Assignments
One of the most fundamental and ubiquitous problems in microeconomics and operations research is how to assign objects to agents based on their individual preferences. An assignment is called popular if there is no other assignment that is preferred by a majority of the agents. Popular assignments need not exist, but the minimax theorem implies the existence of a popular random assignment. In t...
متن کاملEx post Efficiency of Random Assignments ( Extended
In the random assignment problem, objects are randomly assigned to agents keeping in view the agents’ preferences over objects. A random assignment specifies the probability of an agent getting an object. We examine the structural and computational aspects of ex post efficiency of random assignments. We first show that whereas an ex post efficient assignment can be computed easily, checking whe...
متن کاملHybrid ARQ with Random Thansmission Assignments
In mobile packet data and voice networks, a special coding scheme, known as the incremental redundancy hybrid ARQ (IR HARQ), achieves higher throughput efficiency than ordinary turbo codes by adapting its error correcting code redundancy to fluctuating channel conditions characteristic for this application. An IR HARQ protocol operates as follows. Initially, the information bits are encoded by ...
متن کاملPairs of SAT Assignments and Clustering in Random Boolean Formulæ
We investigate geometrical properties of the random K-satisfiability problem. For large enough K, we prove that there exists a region of clause density, below the satisfiability threshold, where SAT assignments are grouped into well separated clusters. This confirms the validity of the clustering scenario which is at the heart of the recent heuristic analysis of satisfiability using statistical...
متن کاملCounting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of ‘good’ truth assignments for a random k-satisfiability (k-SAT) formula in polynomial time (by ‘good’ we mean that violate a small fraction of clauses). The relative error is bounded above by an arbitrarily small constant ǫ with high probability as long as the clause density (ratio of clauses to variables) α...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Economics
سال: 2020
ISSN: 0304-4068
DOI: 10.1016/j.jmateco.2019.12.003